Maximal Concurent Limited Cost Flow Problems on Extended Multi-commodity Multi-cost Network
نویسندگان
چکیده
منابع مشابه
On Pairwise Cost for Multi-Object Network Flow Tracking
Multi-object tracking has been recently approached with the min-cost network flow optimization techniques. Such methods simultaneously resolve multiple object tracks in a video and enable modeling of dependencies among tracks. Min-cost network flow methods also fit well within the “tracking-by-detection” paradigm where object trajectories are obtained by connecting per-frame outputs of an objec...
متن کاملOn Minimum Concave Cost Network Flow Problems
Minimum concave Cost Network Flow Problems (MCNFPs) arise naturally in many practical applications such as communication, transportation, distribution, and manufacturing, due to economic considerations. In addition, it has been shown that every MCNFP with general nonlinear cost functions can be transformed into a concave MCNFP on an expanded network. It must also be noted, that multiple source ...
متن کاملDesigning Multi - Commodity Flow
The traditional multi-commodity ow problem assumes a given ow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity ow network-design problem: given a set of multi-commodity ow demands, nd a network subject to certain constraints such that the commodities can be maximally routed. This paper focuses on the case whe...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملImproved Local Search Algorithms with Multi-Cycle Reduction for Minimum Concave Cost Network Flow Problems
The minimum concave cost network flow problem (MCCNFP) has many applications in areas such as telecommunication network design, facility location, production and inventory planning, and traffic scheduling and control. However, it is a well known NP-hard problem, and all existing search based exact algorithms are not practical for networks with even moderate numbers of vertices. Therefore, the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Applied Mathematics
سال: 2020
ISSN: 2330-0043
DOI: 10.11648/j.ajam.20200803.11